منابع مشابه
Pavelka-style Fuzzy Logic for Attribute Implications
We present Pavelka-style fuzzy logic for reasoning about attribute implications, i.e. formulas A ⇒ B known also as association rules and functional dependencies. Fuzzy attribute implications allow for two different interpretations, namely, in data tables with graded (fuzzy) attributes and in data tables over domains with similarity relations. In the first interpretation, A ⇒ B reads “each objec...
متن کاملCAISL: Simplification Logic for Conditional Attribute Implications
In this work, we present a sound and complete axiomatic system for conditional attribute implications (CAI s) in Triadic Concept Analysis (TCA). Our approach is strongly based on the Simplification paradigm which offers a more suitable way for automated reasoning than the one based on Armstrong’s Axioms. We also present an automated method to prove the derivability of a CAI from a set of CAI s.
متن کاملFuzzy logic programming reduced to reasoning with attribute implications
We present a link between two types of logic systems for reasoning with graded if–then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characte...
متن کاملFuzzy Attribute Logic: Attribute Implications, Their Validity, Entailment, and Non-redundant Basis∗
We present results related to if-then rules and extraction of if-then rules from data tables with fuzzy attibutes. We provide basic definitions and results related to validity of if-then rules, semantic entailment, non-redundant bases, automatic generation of non-redundant bases, and relationships to concept lattices over data with fuzzy attributes.
متن کاملRational fuzzy attribute logic
We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2016
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-016-9526-6